On The Quantization Of Constraint Systems: A Lagrangian Approach

نویسنده

  • F. Loran
چکیده

It is possible to introduce external time dependent back ground fields in the formulation of a system as fields whose dynamics can not be deduced from Euler Lagrange equations of motion. This method leads to singular Lagrangians for real systems. We discuss quantization of constraint systems in these cases and introduce generalized Gupta-Bleuler quantization. In two examples we show explicitly that this method of quantization leads to true Schrödinger equations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint

In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...

متن کامل

Canonical Lagrangian Dynamics and General Relativity

Building towards a more covariant approach to canonical classical and quantum gravity we outline an approach to constrained dynamics that de-emphasizes the role of the Hamiltonian phase space and highlights the role of the Lagrangian phase space. We identify a “Lagrangian one-form” to replace the standard symplectic one-form, which we use to construct the canonical constraints and an associated...

متن کامل

Integer Programming Approach to Fixed-rate Entropy-coded Quantization

| This paper describes two new xed-rate entropy-coded quantization methods for stationary memoryless sources where the structure of code-words are derived from a variable-length scalar quantizer. In the rst method, we formulate the quantization as a zero-one integer optimization problem. We show that the resulting integer program can be closely approximated by solving a simple linear program. T...

متن کامل

A Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem

In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...

متن کامل

A Low Complexity Method for Fixed rate Entropy coded Vector Quantization based on Integer Programming

This paper describes a new approach to Fixed rate Entropy coded Vector Quanti zation FEVQ for stationary memoryless sources where the structure of code words are derived from a variable length scalar quantizer We formulate the quantization search operation as a zero one integer optimization problem and show that the resulting integer program can be closely approximated by solving a simple linea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002